Reasoning about Concurrent Indexes
نویسنده
چکیده
Index data structures such as B+ trees and hash tables are used widely as the core of databases andfile systems. In a world where concurrent systems are common as servers and largely increasing aspersonal computers, we need a way to make sure concurrent implementations do not contain bugs.We use the fact that multiple implementations share a common high-level specification and useconcurrent abstract predicates to prove that an implementation satisfies such a specification. Thisapproach allows us to reuse the abstract specification and enables high-level reasoning independentfrom the low-level implementation.
منابع مشابه
Temporal Relevant Logic as the Logic Basis for Reasoning about Dynamics of Concurrent Systems
Specifying, reasoning, and proving desirable properties of a concurrent system are important formal techniques to achieve the reliability of the system. The logic system that is widely used in the current approaches to specifying, reasoning, and proving properties of a concurrent system is temporal classical logic. This paper proposes a novel research direction, i.e., reasoning about dynamics o...
متن کاملReasoning about the Behavior of Aspect-Oriented Programs
Aspect-oriented programming (AOP) has become increasingly popular over the last few years. At the same time, a number of authors have raised serious questions about the problems involved in reasoning about the behavior of aspect-oriented programs. In this paper, we present a rely-guarantee-approach to such reasoning. The rely-guarantee approach has proven useful in reasoning about concurrent an...
متن کاملRely-Guarantee Approach to Reasoning about AOP
Over the last few years, the question of reasoning about aspectoriented programs has been addressed by a number of authors. In this paper, we present a rely-guarantee approach to such reasoning. The rely-guarantee approach has proven extremely successful in reasoning about concurrent and distributed programs. We show that some of the key problems encountered in reasoning about aspectoriented pr...
متن کاملPanini: A Concurrent Programming Model for Solving Pervasive & Oblivious Interference
Modular reasoning about concurrent programs is complicated by the possibility of interferences happening between any two instructions of a task (pervasive interference), and these interferences not giving out any information about the behaviors of potentially interfering concurrent tasks (oblivious interference). Reasoning about a concurrent program would be easier if a programmer, modularly an...
متن کاملModeling Actions with Ramifications in Nondeterministic, Concurrent, and Continuous Domains Š and a Case Study
Combining into a consistent theory co-existing models for different phenomena in reasoning about actions can be a problem as challenging as addressing new aspects. We present a uniform theory for reasoning about actions with indirect effects in nondeterministic, concurrent, and continuous domains. We report on a case study to which our theory has been successfully applied.
متن کامل